Parallel Refinement of Unstructured Meshes
نویسندگان
چکیده
In this paper we describe a parallel h-refinement algorithm for unstructured finite element meshes based on the longest-edge bisection of triangles and tetrahedrons. This algorithm is implemented in PARED, a system that supports the parallel adaptive solution of PDEs. We discuss the design of such an algorithm for distributed memory machines including the problem of propagating refinement across processor boundaries to obtain meshes that are conforming and non-degenerate. We also demonstrate that the meshes obtained by this algorithm are equivalent to the ones obtained using the serial longest-edge refinement method. We finally report on the performance of this refinement algorithm on a network of workstations.
منابع مشابه
Parallel Two-Dimensional Unstructured Anisotropic Delaunay Mesh Generation for Aerospace Applications
PARALLEL TWO-DIMENSIONAL UNSTRUCTURED ANISOTROPIC DELAUNAY MESH GENERATION FOR AEROSPACE APPLICATIONS Juliette Kelly Pardue Old Dominion University, 2015 Director: Dr. Andrey Chernikov A bottom-up approach to parallel anisotropic mesh generation is presented by building a mesh generator from the principles of point-insertion, triangulation, and Delaunay refinement. Applications focusing on high...
متن کاملPaper submitted to : Third National Symposium on Large - Scale Structural Analysis for High - Performance Computers and Workstations Computational Results for Parallel Unstructured Mesh Cornput at ionst
The majority of finite element models in structural engineering are composed of unstructured meshes. These unstructured meshes are often very large and require significant computational resources; hence they are excellent candidates for massively parallel computation. Parallel solution of the sparse matrices that arise from such meshes has been studied heavily, and many good algorithms have bee...
متن کاملPaper Submitted To: Third National Symposium on Large-scale Structural Analysis for High-performance Computers and Workstations Computational Results for Parallel Unstructured Mesh Computations
The majority of nite element models in structural engineering are composed of unstructured meshes. These unstructured meshes are often very large and require signiicant computational resources; hence they are excellent candidates for massively parallel computation. Parallel solution of the sparse matrices that arise from such meshes has been studied heavily, and many good algorithms have been d...
متن کاملNovel Algorithms for Modeling Sedimentation and Compaction using 3D Unstructured Meshes
In this paper, we discuss some novel techniques for modeling sedimentation and compaction using fully unstructured meshes. The numerical modeling of the sedimentation process is a critical part of basin simulation and synthetic stratigraphy modeling. Normally, structured curvilinear meshes are used to represent sedimentary sequences to be deposited during the simulation. Using this approach, 2D...
متن کامل